Semantics for Modelling Reason-Based Preferences
نویسندگان
چکیده
In [13] the authors developed a logical system based on the definition of a new non-classical connective ⊗ originally capturing the notion of reparative obligation. The operator⊗ and the system were proved to be appropriate for rather handling well-known contrary-to-duty paradoxes. Later on, a suitable modeltheoretic possible-world semantics has been developed [4, 5]. In this paper we show how a version of this semantics can be used to develop a sound and complete logic of preference and offer a suitable possible-world semantics. The semantics is a sequence-based non-normal one extending and generalising semantics for classical modal logics.
منابع مشابه
Preference-Based Argumentation Handling Dynamic Preferences Built on Prioritized Logic Programming
To treat dynamic preferences correctly is crucially required in the fields of argumentation as well as nonmonotonic reasoning. To meet such requirements, first, we propose a hierarchical Prioritized Logic Program (or a hierarchical PLP, for short), which enhances the formalism of Sakama and Inoue’s PLP so that it can represent and reason about dynamic preferences. Second, using such a hierarchi...
متن کاملArgumentation-Based Qualitative Preference Modelling with Incomplete and Uncertain Information
This paper presents an argumentation-based framework for the modelling of, and automated reasoning about multi-attribute preferences of a qualitative nature. The framework presents preferences according to the lexicographic ordering that is well-understood by humans. Preferences are derived in part from knowledge. Knowledge, however, may be incomplete or uncertain. The main contribution of the ...
متن کاملArgumentation-Based Preference Modelling with Incomplete Information
No intelligent decision support system functions even remotely without knowing the preferences of the user. A major problem is that the way average users think about and formulate their preferences does not match the utility-based quantitative frameworks currently used in decision support systems. For the average user qualitative models are a better fit. This paper presents an argumentationbase...
متن کاملA semantics based approach to privacy languages
A key reason for the slow adoption of the Platform for Privacy Preferences (P3P) is the lack of a formal semantics. Without a formal semantics, a P3P policy may be semantically inconsistent and may be interpreted and represented differently by different user agents. In this paper, we redress these problems by proposing a relational formal semantics for P3P policies, which precisely models the r...
متن کاملReduction-Based Approaches to Implement Modgil's Extended Argumentation Frameworks
This paper reconsiders Modgil’s Extended Argumentation Frameworks (EAFs) that extend Dung’s abstract argumentation frameworks by attacks on attacks. This allows to encode preferences directly in the framework and thus also to reason about the preferences themselves. As a first step to reduction-based approaches to implement EAFs, we give an alternative (but equivalent) characterization of accep...
متن کامل